120C - Winnie-the-Pooh and honey - CodeForces Solution

#include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e9+7;
#define coy cout << "YES" << endl
#define con cout << "NO" << endl
#define all(v) (v).begin(), (v).end()
#define lcm(a, b) ((a * b) / (__gcd(a, b)))

using namespace std;

void solve(){
        int n,k,ans=0;
        cin>>n>>k;
        std::vector<int> vc(n);
        for(int i=0;i<n;i++)cin>>vc[i];
        for(int j=0;j<3;j++){
            for(int i=0;i<n;i++){
                if(vc[i]>=k)vc[i]-=k;
            }
        }
        cout<<( accumulate(vc.begin(),vc.end(),0));

    }
    
int main(){

   freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);

    
    
    solve();


    
}